The weighted independent domination problem is NP-complete for chordal graphs
نویسندگان
چکیده
منابع مشابه
The weighted independent domination problem is NP-complete for chordal graphs
The concept of domination in graph theory is a natural model for many location problems in operations research. In a graph G = (V, E), a dominating set is a subset D of V such that every vertex not in D is adjacent to at least one vertex in D. The domination problem is to determine, for a graph G and a positive integer k, if G has a dominating set of size at most k. Domination and its variation...
متن کاملComplete minors, independent sets, and chordal graphs
The Hadwiger number h(G) of a graph G is the maximum size of a complete minor of G. Hadwiger’s Conjecture states that h(G) ≥ χ(G). Since χ(G)α(G) ≥ |V (G)|, Hadwiger’s Conjecture implies that α(G)h(G) ≥ |V (G)|. We show that (2α(G) − ⌈log τ (τα(G)/2)⌉)h(G) ≥ |V (G)| where τ ≈ 6.83. For graphs with α(G) ≥ 14, this improves on a recent result of Kawarabayashi and Song who showed (2α(G) − 2)h(G) ≥...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملWeighted Independent Perfect Domination on Cocomparability Graphs
*Supported partly by the National Science Council of the Republic of China under grant NSC82-0208-M009-050. IDIMACS permanent member. lCurrent address: Laboratory for Computer Science, MIT, Cambridge, MA 02139. Emaih [email protected].
متن کاملEulerian disjoint paths problem in grid graphs is NP-complete
We show that the edge disjoint paths problem is NP-complete in directed or undirected rectangular grids, even if the union G + H of the supply and the demand graph is Eulerian.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.05.004